class Solution:
    def maxArea(self, height: List[int]) -> int:
        nums = len(height)
        sque = []
        for i in range(nums - 1):
            start_n = i
            max_h = height[i + 1]
            max_hi = i + 1
            for j in range(i + 1, nums):
                if height[j] > max_h:
                    max_h = height(j)
                    max_hi = j
            max_gao = (min(height[i], max_h)) * (max_hi - i + 1)
            max_chang = (min(height[i], heightnums - 1))) * (nums - i)
            sque.append(max(max_gao, max_chang))

        return max(sque)

